Search results for "Prime power"

Characters that agree on prime-power-order elements

2003

Primitive subgroups and PST-groups

2014

AbstractAll groups considered in this paper are finite. A subgroup $H$ of a group $G$ is called a primitive subgroup if it is a proper subgroup in the intersection of all subgroups of $G$ containing $H$ as a proper subgroup. He et al. [‘A note on primitive subgroups of finite groups’, Commun. Korean Math. Soc. 28(1) (2013), 55–62] proved that every primitive subgroup of $G$ has index a power of a prime if and only if $G/ \Phi (G)$ is a solvable PST-group. Let $\mathfrak{X}$ denote the class of groups $G$ all of whose primitive subgroups have prime power index. It is established here that a group $G$ is a solvable PST-group if and only if every subgroup of $G$ is an $\mathfrak{X}$-group.

Solvable groups withp-modular character degrees of prime power

1990

Restriction of odd degree characters and natural correspondences

2016

Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…

A series of finite groups and related symmetric designs

2007

For any odd prime power q = pe we study a certain solvable group G of order q2 · ((q-1)/2)2 · 2 and construct from its internal structure a symmetric design D with parameters (2q2+1, q2, (q2-1)/2) on which G acts as an automorphism group. As a consequence we find that the full automorphism group of D contains a subgroup of order |G| · e2.

Nonmalleable encryption of quantum information

2008

We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification of the encrypted state can be effected. We show that such a scheme is equivalent to a "unitary 2-design" [Dankert et al.], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d^2-1)^2+1 on the number of unitaries in a 2-design [Gross et al.], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with =…

On the number of different prime divisors of element orders

2005

We prove that the number of different prime divisors of the order of a finite group is bounded by a polynomial function of the maximum of the number of different prime divisors of the element orders. This improves a result of J. Zhang.